翻訳と辞書 Words near each other ・ Optimatoi ・ Optimax ・ Optime (disambiguation) ・ OptimFROG ・ Optimisation of cutting cycles in conventional underground coal sections to improve productivity ・ Optimism ・ Optimism bias ・ Optimism Monthly Magazine ・ Optimist ・ Optimist (dinghy) ・ Optimist Brain Bowl ・ Optimist International ・ Optimistic (Skeeter Davis song) ・ Optimistic concurrency control ・ Optimistic decompression ・ Optimistic knowledge gradient ・ Optimistic replication ・ Optimistic Voices ・ Optimistique-moi ・ Optimists Cricket Club ・ Optimization (disambiguation) ・ Optimization (role-playing games) ・ Optimization mechanism ・ Optimization problem ・ Optimization Programming Language ・ Optimization software ・ Optimization Toolbox ・ Optimize (magazine) ・ Optimize Capital Markets ・ Optimized Athlete Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Optimistic knowledge gradient ： ウィキペディア英語版 Optimistic knowledge gradient In statistics The optimistic knowledge gradient〔() Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling Xi Chen, Qihang Lin, Dengyong Zhou; 16(Jan):1−46, 2015.〕 is a new approximation policy proposed by Xi Chen, Qihang Lin and Dengyong Zhou in 2013. This policy is created to solve the challenge of computationally intractable of large size of optimal computing budget allocation problem in binary/multi-class crowd labeling where each label from the crowd has a certain cost.〔() Proceedings of the 30-th International Conference on Machine Learning, Atlanta, Georgia, USA, 2013. JMLR:W&CP volume 28. Xi Chen, Qihang Lin, Dengyong Zhou〕 ==Motivation== The optimal computing budget allocation problem is formulated as a Bayesian Markov decision process〔 *(Learning to Solve Markovian Decision Processes ) by (Satinder P. Singh )〕(MDP) and is solved by using the dynamic programming (DP) algorithm where the Optimistic knowledge gradient policy is used to solve the computationally intractable of the dynamic programming〔(An Introduction to Dynamic Programming )〕 (DP) algorithm. Consider a budget allocation issue in crowdsourcing. The particular crowdsourcing problem we considering is crowd labeling. Crowd labeling is a large amount of labeling tasks which are hard to solve by machine, turn out to easy to solve by human beings, then we just outsourced to an unidentified group of random people in a distributed environment. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Optimistic knowledge gradient」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.